Combinatorial auctions with verification are tractable
نویسندگان
چکیده
منابع مشابه
Some Tractable Combinatorial Auctions
Auctions are the most widely used strategic gametheoretic mechanism in the Internet. Auctions have been mostly studied from a game-theoretic and economic perspective, although recent work in AI and OR has been concerned with computational aspects of auctions as well. When faced from a computational perspective, combinatorial auctions are perhaps the most challenging type of auctions. Combinator...
متن کاملTractable Combinatorial Auctions Via Graph Matching
Combinatorial auctions play a key role in distributed AI as a mechanism for efficiently allocating resources or tasks, both for cooperative and competitive scenarios. The complexity of the general problem has lead to interest in finding efficient algorithms for useful instances. Tennenholtz introduced an approach which finds polynomial solutions for certain classes of combinatorial auctions by ...
متن کاملCombinatorial Auctions with Budgets
We consider budget constrained combinatorial auctions where bidder i has a private value vi for each of the items in some set Si, agent i also has a budget constraint bi. The value to agent i of a set of items R is |R ∩ Si| · vi. Such auctions capture adword auctions, where advertisers offer a bid for those adwords that (hopefully) reach their target audience, and advertisers also have budgets....
متن کاملCombinatorial Auctions with Transportation Cost
The ability to discover equilibrium prices efficiently makes auctions an effective way to trade goods. One of the recent trends in the development of auctions is combinatorial auctions. Combinatorial auctions allow the simultaneous sale of more than one item. In the existing literature, the factor of transportation cost has not been considered in combinatorial auctions. In this paper, we formul...
متن کاملRobot exploration with combinatorial auctions
We study how to coordinate a team of mobile robots to visit a number of given targets in partially unknown terrain. Robotics researchers have studied singleitem auctions (where robots bid on single targets) to perform this exploration task but these do not take synergies between the targets into account. We therefore design combinatorial auctions (where robots bid on bundles of targets), propos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.01.001